Swift: A Fast Dynamic Packet Filter
نویسندگان
چکیده
This paper presents Swift, a packet filter for high performance packet capture on commercial off-the-shelf hardware. The key features of Swift include (1) extremely low filter update latency for dynamic packet filtering, and (2) Gbps high-speed packet processing. Based on complex instruction set computer (CISC) instruction set architecture (ISA), Swift achieves the former with an instruction set design that avoids the need for compilation and security checking, and the latter by mainly utilizing SIMD (single instruction, multiple data). We implement Swift in the Linux 2.6 kernel for both i386 and x86 64 architectures. The Swift userspace library supports two sets of application programming interfaces (APIs): a BPF-friendly API for backward compatibility and an object oriented API for simplifying filter coding. We extensively evaluate the dynamic and static filtering performance of Swift on multiple machines with different hardware setups. We compare Swift with BPF (the BSD packet filter)—the de facto standard for packet filtering in modern operating systems—and hand-coded optimized C filters that are used for demonstrating possible performance gains. For dynamic filtering tasks, Swift is at least three orders of magnitude faster than BPF in terms of filter update latency. For static filtering tasks, Swift outperforms BPF up to three times in terms of packet processing speed, and achieves much closer performance to the optimized C filters.
منابع مشابه
Designinga Neuro-Sliding Mode Controller for Networked Control Systems with Packet Dropout
This paper addresses control design in networked control system by considering stochastic packet dropouts in the forward path of the control loop. The packet dropouts are modelled by mutually independent stochastic variables satisfying Bernoulli binary distribution. A sliding mode controller is utilized to overcome the adverse influences of stochastic packet dropouts in networked control system...
متن کاملApproximate Dynamic Analysis of Structures for Earthquake Loading Using FWT
Approximate dynamic analysis of structures is achieved by fast wavelet transform (FWT). The loads are considered as time history earthquake loads. To reduce the computational work, FWT is used by which the number of points in the earthquake record are reduced. For this purpose, the theory of wavelets together with filter banks are used. The low and high pass filters are used for the decompositi...
متن کاملA Packet Classification and Filter Management System
Packet classification and fast filter matching have been an important field of research in the recent past. Several algorithms have been proposed for fast packet classification. In this paper, we first present a new filter matching scheme called EntryPruned Tuple Search and discuss its advantages over previously presented algorithms. We then show how this algorithm blends very well with an earl...
متن کاملJoint cross-layer design for wireless QoS video delivery
In this paper, we propose “cross layer” design, such as swift-OFDM, low-latency packet-awareness coder and adaptive noise filtering design for wireless multimedia delivery. Unlike the conventional error correction code, we take the bursty nature of wireless Internet into our coder design consideration. Furthermore, we adaptively filter out noise based on image content so that we can reduce nois...
متن کاملA New Orthonormal Wavelet Packet Decomposition for Audio Coding Using Frequency-varying Modulated Lapped Transforms
Wavelet packet decompositions based on tree structured 2-channel filter banks with conjugate quadrature filters (CQF) have recently found many applications in the area of audio coding. Their time-frequency tiling is dual to that of timevarying modulated lapped transforms (MLT). In this paper we present a new orthonormal wavelet packet basis, which is constructed by frequency-varying MLT. These ...
متن کامل